skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Creators/Authors contains: "Fragouli, C"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, COLM 2025)
    Free, publicly-accessible full text available October 10, 2026
  2. ; ; (, Advances in Neural Information Processing Systems 36)
    Accepted Manuscript Full Text Available
  3. ; ; ; ; (, IEEE Control and Decision Conference (CDC))
    Accepted Manuscript Full Text Available
  4. ; ; ; (, IEEE International Symposium on Information Theory (ISIT))
    The problem of reconstructing a sequence when observed through multiple looks over deletion channels occurs in “de novo” DNA sequencing. The DNA could be sequenced multiple times, yielding several “looks” of it, but each time the sequencer could be noisy with (independent) deletion impairments. The main goal of this paper is to develop reconstruction algorithms for a sequence observed through the lens of a fixed number of deletion channels. We use the probabilistic model of the deletion channels to develop both symbol-wise and sequence maximum likelihood decoding criteria, and algorithms motivated by them. Numerical evaluations demonstrate improvement in terms of edit distance error, over earlier algorithms. 
    more » « less
    Accepted Manuscript Full Text Available
  5. ; ; ; (, IEEE International Symposium on Information Theory (ISIT))
    Accepted Manuscript Full Text Available
  6. ; ; (, International Conference on Information Theoretic Security (ICITS))
    Full Text Available